Evaluation of Effective Resistances in Pseudo-Distance-Regular Resistor Networks
نویسندگان
چکیده
منابع مشابه
Calculating two-point resistances in distance-regular resistor networks
An algorithm for the calculation of the resistance between two arbitrary nodes in an arbitrary distance-regular resistor network is provided, where the calculation is based on stratification introduced in [1] and Stieltjes transform of the spectral distribution (Stieltjes function) associated with the network. It is shown that the resistances between a node α and all nodes β belonging to the sa...
متن کاملOn electric resistances for distance-regular graphs
We investigate the behavior of electric potentials on distance-regular graphs, and extend some results of a prior paper, [12]. Our main result, Theorem 4 below, shows(together with Corollary 3) that if distance is measured by the electric resistance between points then all points are close to being equidistant on a distance-regular graph with large valency. A number of auxiliary results are als...
متن کاملRecursive calculation of effective resistances in distance-regular networks based on Bose-Mesner algebra and Christoffel-Darboux identity
Recently in [1], the authors have given a method for calculation of the effective resistance (resistance distance) on distance-regular networks, where the calculation was based on stratification introduced in [2] and Stieltjes transform of the spectral distribution (Stieltjes function) associated with the network. Also, in Ref. [1] it has been shown that the resistance distances between a node ...
متن کاملLocally Pseudo-Distance-Regular Graphs
The concept of local pseudo-distance-regularity, introduced in this paper, can be thought of as a natural generalization of distance-regularity for non-regular graphs. Intuitively speaking, such a concept is related to the regularity of graph 1 when it is seen from a given vertex. The price to be paid for speaking about a kind of distance-regularity in the non-regular case seems to be locality....
متن کاملPseudo 1-homogeneous distance-regular graphs
Let be a distance-regular graph of diameter d ≥ 2 and a1 = 0. Let θ be a real number. A pseudo cosine sequence for θ is a sequence of real numbers σ0, . . . , σd such that σ0 = 1 and ciσi−1 + aiσi + biσi+1 = θσi for all i ∈ {0, . . . , d−1}. Furthermore, a pseudo primitive idempotent for θ is Eθ = s ∑di=0 σiAi , where s is any nonzero scalar. Let v̂ be the characteristic vector of a vertex v ∈ V...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Physics
سال: 2010
ISSN: 0022-4715,1572-9613
DOI: 10.1007/s10955-009-9909-8